Workload Balancing on Identical Parallel Machines: Theoretical and Computational Analysis
نویسندگان
چکیده
منابع مشابه
Analysis of Different Criteria for Workload Balancing on Identical Parallel Machines
This paper deals with the workload balancing problem in identical parallel machines context. It consists of assigning n different jobs to m identical parallel machines as equally as possible. First, we present a critical analysis of classical formulation based on the minimization of the maximum workload or the completion time of the bottleneck machine previously presented in the literature. We ...
متن کاملOn the Minimization of Workload Balancing Criteria on Identical Parallel Machines
This paper studies the problem of scheduling jobs on identical parallel processors to minimize workload balancing criteria. While workload balancing is certainly an important criterion given the need of production systems to use all of their resources efficiently, there is no established measure of performance in the scheduling literature that characterizes total workload balance. In this paper...
متن کاملMinimizing the Normalized Sum of Square for Workload Deviations on Identical Parallel Machines
In many organizations, it is desirable to distribute workload as equally as possible among a group of employees or machines. This paper proposes a performance measure, that we call the Normalized Sum of Square for Workload Deviations (NSSWD), and studies the problem of how to schedule a set of n jobs on m parallel identical processors in order to minimize the NSSWD. The NSSWD criterion is relev...
متن کاملMinimizing Makespan on Identical Parallel Machines
A heuristic algorithm that uses iteratively LPT and MF approaches on different job and machine sets constructed by using the current solution is developed to solve a classical multiprocessor scheduling problem with the objective of minimizing the makespan. Computational results indicate that the proposed algorithm is very competitive with respect to well-known constructive algorithms for a larg...
متن کاملOn-Line Load Balancing of Temporary Tasks on Identical Machines
We prove an exact lower bound of 2 1 m on the competitive ratio of any deterministic algorithm for load balancing of temporary tasks on m identical machines. We also show a lower bound of 2 1 m for randomized algorithms for small m and 2 2 m+1 for general m. If in addition, we restrict the sequence to polynomial length, then the lower bound for randomized algorithms becomes 2 O( log logm logm )...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Sciences
سال: 2021
ISSN: 2076-3417
DOI: 10.3390/app11083677